On Market-Inspired Approaches to Propositional Satisfiability
نویسندگان
چکیده
We describe two market-inspired approaches to propositional satisfiability. Whereas a previous market-inspired approach exhibited extremely slow performance, we find that variations on the pricing method with a simplified market structure can improve performance significantly. We compare the performance of the new protocols with the previous market protocol and with the distributed breakout algorithm on benchmark 3-SAT problems. We identify a tradeoff between performance and economic realism in the new market protocols, and a tradeoff between performance and the degree of decentralization between the new market protocols and distributed breakout. We also conduct informal and experimental analyses to gain insight into the operation of price-guided search.
منابع مشابه
A Complete Adaptive Algorithm for Propositional Satisfiability
An approach to propositional satisfiability using an adaptive procedure is described. Its main feature is a new branching rule, which is able to identify, at an early stage, hard sub-formulae. Such branching rule is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a clause based branching tree. Completeness i...
متن کاملHeuristic-Based Backtracking for Propositional Satisfiability
In recent years backtrack search algorithms for Propositional Satisfiability (SAT) have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully solve instances with thousands of variables and hundreds of thousands of clauses, and also motivated the development of many new challenging problem instances, many of which still too hard for the current genera...
متن کاملSyntactic Characterization of Propositional Satisfiability
The subject of the research reported in this thesis belongs to the area known as Propositional Satisfiability, an area located in the intersection of Theoretical Computer Science, Artificial Intelligence, and Mathematical Logic. In this thesis I show that the set of satisfying truth-value assignments of a satisfiable propositional formula can be constructed from the syntactic structure of the f...
متن کاملSolving the Round Robin Problem Using Propositional Logic
In this paper we present a new and extremely competitive approach to solving a notoriously hard problem from the sports scheduling domain, the round robin problem. By combining local search satisfiability algorithms and an appropriate problem encoding based on classical propositional logic, we are able to find feasible schedules many times faster than using the best existing approaches to the r...
متن کاملRelaxed ∃-Step Plans in Planning as SMT
Planning Modulo Theories (PMT), inspired by Satisfiability Modulo Theories (SMT), allows the integration of arbitrary first order theories, such as linear arithmetic, with propositional planning. Under this setting, planning as SAT is generalized to planning as SMT. In this paper we introduce a new encoding for planning as SMT, which adheres to the relaxed relaxed ∃-step (R∃-step) semantics for...
متن کامل